Optimal probabilistic allocation of customer types to servers
نویسندگان
چکیده
منابع مشابه
Optimal Allocation of Clients to Replicated Multicast Servers
Server replication is an approach that is often used to improve the scalability of a service. One of the important factors in the eecient utilization of replicated servers is the ability to direct client requests to the \best" server, according to some optimality criteria. Recently, there have been several proposals for multicast services in which a server delivers information to multiple clien...
متن کاملa benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولOptimal Allocation of Multimedia Servers in the 3G Wireless Networks
We propose a multimedia server allocation problem in the 3G wireless networks as a generalized assignment problem (GAP) with an objective of minimizing the total multimedia applications access cost. Because the GAP is a well known NP hard problem, we use the Lagrangian relaxation (LR) heuristic to compute a lower bound on the total multimedia applications access cost. For small size problems, w...
متن کاملOptimal Allocation of Ships to Quay Length in Container Ports
Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...
متن کاملOptimal Allocation of Multiple Servers to Parallel Queues With Independent Random Connectivity
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical, randomly connected servers. Each queue may be connected to a subset of the K servers during any given time slot. This model has been widely used in studies of emerging 3G/4G wireless systems. We introduce the class of Most Balancing (MB) policies and provide their mathemat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 1995
ISSN: 0163-5999
DOI: 10.1145/223586.223601